منابع مشابه
SC-hyperdecidability of R
A class TC(X) of X-graphs is introduced, and an algorithmic property of labellings of nite strongly connected graphs by rational languages is shown to be decidable. This property, named as TC-inevitability, is a language-theoretic analogue of the R-inevitability of labellings of nite strongly connected graphs by nite monoids. As a consequence, the pseudovariety R of all nite R-trivial monoids i...
متن کاملSC(R)3: towards usability of formal methods
This paper gives an overview of SC(R)3 { a toolset designed to increase the usability of formal methods for software development. Formal requirements are speci ed in SC(R)3 in an easy to use and review format, and then used in checking requirements for correctness and in verifying consistency between annotated code and requirements. In this paper we discuss motivations behind this work, describ...
متن کاملTwo-gap superconductivity in R2Fe3Si5 (R = Lu and Sc)
High-quality single crystals of Lu2Fe3Si5 and Sc2Fe3Si5 are grown by the floatingzone method, and their temperature dependences of specific heat are measured down to 0.35 K. Both compounds show anomalously small jump in specific heat at the superconducting transition temperature, Tc, and large residual specific heat coefficient even at 0.2Tc, where BCS superconductor shows negligible electronic...
متن کاملType II theorem and hyperdecidability of pseudovarieties of groups
The problem of computing the kernel of a finite monoid, popularized under the name “Rhodes type II conjecture”, led Ash to the proof of a strong property (the hyperdecidability) of the pseudovariety G of all finite groups. This paper is a survey of recent results on the study of some related properties of pseudovarieties of groups.
متن کاملClustering of multiple specific genes and gene-rich R-bands around SC-35 domains
Typically, eukaryotic nuclei contain 10-30 prominent domains (referred to here as SC-35 domains) that are concentrated in mRNA metabolic factors. Here, we show that multiple specific genes cluster around a common SC-35 domain, which contains multiple mRNAs. Nonsyntenic genes are capable of associating with a common domain, but domain "choice" appears random, even for two coordinately expressed ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2001
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(99)00329-1